Designing Optimal Flow Networks∗

نویسندگان

  • M. G. Volz
  • M. Brazil
  • K. J. Swanepoel
  • D. A. Thomas
چکیده

We investigate the problem of designing a minimum cost flow network interconnecting n sources and a single sink, each with known locations and flows. The network may contain other unprescribed nodes, known as Steiner points. For concave increasing cost functions, a minimum cost network of this sort has a tree topology, and hence can be called a Minimum Gilbert Arborescence (MGA). We characterise the local topological structure of Steiner points in MGAs for linear cost functions. This problem has applications to the design of drains, gas pipelines and underground mine access.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Method for Designing and Optimization of Networks

In this paper, system planning network is formulated with mixed-integer programming. Two meta-heuristic procedures are considered for this problem. The cost function of this problem consists of the capital investment cost in discrete form, the cost of transmission losses and the power generation costs. The DC load flow equations for the network are embedded in the constraints of the mathematica...

متن کامل

A mathematical model for designing optimal urban gas networks, an ant colony algorithm and a case study

Considering the high costs of the implementation and maintenance of gas distribution networks in urban areas, optimal design of such networks is vital. Today, urban gas networks are implemented within a tree structure. These networks receive gas from City Gate Stations (CGS) and deliver it to the consumers. This study presents a comprehensive model based on Mixed Integer Nonlinear Programming (...

متن کامل

A New Model for Designing Gas Distribution Networks

A new model for the design of the city gas distribution network has been presented. On the basis of mass flow rates and pressure balances a nonlinear system of equation is obtained. A method for solving the latter is outlined which gives accurate results. Also, this method, when compared to the other accessible ones, takes less computer time. Finally in this method the actual length of netw...

متن کامل

Hydrothermal Optimal Power Flow Using Continuation Method

The problem of optimal economic operation of hydrothermal electric power systems is solved using powerful continuation method. While in conventional approach, fixed generation voltages are used to avoid convergence problems, in the proposed algorithm, they are treated as variables so that better solutions can be obtained. The algorithm is tested for a typical 5-bus and 17-bus New Zealand networ...

متن کامل

The Optimal Placement of Distributed Generation (DG) to Improve the Voltage Profile and Reduce Losses in Radial Distribution Networks Using PSO

Voltage profile and losses are important factors in a distribution network in which there arevariety of ways to improve them. In this paper, distributed generation (DG) is used as a solutionto improve the above characteristics. Backward/Forward Sweep load flow algorithm is used dueto the inefficiency of usual load flow algorithms because of high R/X ratio and their lack ofconvergence in distrib...

متن کامل

The Optimal Power Flow of Multiple Energy Carriers in Networked Multi-Carrier Microgrid

The future distribution network comprising different energy carriers will include small-scale energy resources (SSERs) and loads, known as a Networked multi-carrier microgrid (NMCMG). This concept not only leads to an efficient reduction in operation costs, but also encompasses the energy transformation between gas and electric networks at combined nodes, as well as district heating networks. I...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009